package br.unisinos.aidk.searcher;

import java.util.LinkedList;

import br.unisinos.aidk.graph.Node;
import br.unisinos.aidk.graph.Queue;

public class BreadthSearch<V> implements SearchStrategy<V> {

	@Override
	public boolean apply(Queue<Node<V>> queue, LinkedList<Node<V>> nodes) {
		if(nodes.size()==0) return false;
		queue.makeQueue(nodes);
		return true;
	}
}
